A generative pattern model for mining binary datasets.

Mining Top%2DK Patterns from Binary Datasets in Presence of Noise.

Mining%40home toward a public%2Dresource computing framework for distributed data mining.

Building a web%2Dscale image similarity search system.

Rights protection of trajectory datasets with nearest%2Dneighbor preservation.

Caching content%2Dbased queries for robust and efficient image retrieval.

Caching Algorithms for Similarity Search.

CoPhIR a Test Collection for Content%2DBased Image Retrieval

A constraint%2Dbased querying system for exploratory pattern discovery.

Embedding and Retrieving Private Metadata in Electrocardiograms.

7th workshop on large%2Dscale distributed systems for information retrieval %28LSDS%2DIR%2709%29.

Ownership protection of shape datasets with geodesic distance preservation.

Rights Protection of Trajectory Datasets.



A metric cache for similarity search.
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval systems, which are shifting their target towards the Web-scale dimension. In this context, an important issue becomes the design of scalable solutions, which combine parallel and distributed architectures with caching at several levels. To this end, we investigate the design of a similarity cache that works in metric spaces. It is able to answer with exact and approximate results: even when an exact match is not present in cache, our cache may return an approximate result set with quality guarantees. By conducting tests on a collection of one million high-quality digital photos, we show that the proposed caching techniques can have a significant impact on performance, like caching on text queries has been proved effective for traditional Web search engines.
Special track on Engineering Large%2DScale Distributed Systems editorial message.

Crawling%2C Indexing%2C and Similarity Searching Images on the Web.

Parallel Mining of Frequent Closed Patterns Harnessing Modern Computer Architectures.


Mining query logs to optimize index partitioning in parallel web search engines.


ConQueSt a Constraint%2Dbased Querying System for Exploratory Pattern Discovery.

On Interactive Pattern Mining from Relational Databases.
Clustering is an important tool for data mining, since it can  identify major patterns or trends without any supervision (labeled data).
A privacy preserving web recommender system.

Mining frequent closed itemsets out%2Dof%2Dcore.

On Interactive Pattern Mining from Relational Databases.
Clustering is an important tool for data mining, since it can  identify major patterns or trends without any supervision (labeled data).


On condensed representations of constrained frequent patterns.

Pushing Tougher Constraints in Frequent Pattern Mining.
In this paper we extend the state-of-art of the constraints that can be pushed in a frequent pattern computation. We introduce a new class of tough constraints, namely Loose Anti-monotone constraints, and we deeply characterize them by showing that they are a superclass of convertible anti-monotone constraints (e.g. constraints on average or median) and that they model tougher constraints (e.g. variance or standard deviation) which have never been studied before. Then we show how these constraints can be exploited in a levelwise Apriori-like computation by means of new datareduction strategies, outperforming previous algorithms for tough constraints, and exploiting much tougher ones with the same effectiveness.
DCI Closed A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets.
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting and discarding duplicate closed itemsets, without the need of keeping in the main memory the whole set of closed patterns. Our approach can be exploited with substantial performance benefits by any algorithm that adopts a vertical representation of the dataset. We implemented our technique within a new depth-first closed itemsets mining algorithm. The experimental evaluation demonstrates that our algorithm outperforms other state of the art algorithms like CLOSET+ and FPCLOSE. 1.
WebDocs a real%2Dlife huge transactional dataset.

kDCI on using direct count up to the third iteration.

On Closed Constrained Frequent Pattern Mining.
Constrained frequent patterns and closed frequent patterns are two paradigms aimed at reducing the set of extracted patterns to a smaller, more interesting, subset. Although a lot of work has been done with both these paradigms, there is still confusion around the mining problem obtained by joining closed and constrained frequent patterns in a unique framework. In this paper we shed light on this problem by providing a formal definition and a thorough characterization. We also study computational issues and show how to combine the most recent results in both paradigms, providing a very efficient algorithm which exploits the two requirements (satisfying constraints and being closed) together at mining time in order to reduce the computation as much as possible. 1.
kDCI a Multi%2DStrategy Algorithm for Mining Frequent Sets.
09:00 Welcome, introduction, results of the global experiments 10:30 Coffee break 11:00 Panel Session I (session chair: tba) &#034;A fast APRIORI implementation&#034;, by Ferenc Bodon &#034;Efficient Implementations of Apriori and Eclat&#034;, by Christian Borgelt
